The Complete Axiomatization of Cs-congruence
نویسندگان
چکیده
The coupled simulation equivalence is slightly larger than observation equivalence. Where observation equivalence is based on weak bisimulations, coupled simulation equivalence is based on pairs of simulations which coincide at stable states. We establish the corresponding congruence and provide a complete axiomatization by adding a new-law, :(:P + Q) = :P + Q, to the axioma-tization of observation congruence. We further indicate how the deenition of the equivalence can be extended to divergent transition systems.
منابع مشابه
Complete Axiomatization of Observation Congruence for Pmc Complete Axiomatization of Observation Congruence for Pmc
In AM93b] an asynchronous process algebra with multiple clocks, called PMC, was introduced and a complete axiomatization of strong bisimulation equivalence was given for a class of nite state processes. In this report we show how to extend the equational calculus so as to arrive at a complete axiomatization of observation congruence. Completeness is proven for the class of nite processes. With ...
متن کاملReady to Preorder: Get Your BCCSP Axiomatization for Free!
This paper contributes to the study of the equational theory of the semantics in van Glabbeek’s linear time branching time spectrum over the language BCCSP, a basic process algebra for the description of finite synchronization trees. It offers an algorithm for producing a complete (respectively, ground-complete) equational axiomatization of any behavioral congruence lying between ready simulati...
متن کاملAxiomatization of a Class of Parametrised Bisimilarities 1 Axiomatization of a Class of Parametrised Bisimilarities
The question of when two nondeterministic concurrent systems are behaviourally related has occupied a large part of the literature on process algebra and has yielded a variety of equivalences (and congruences) and preorders ( and precongruences) all based on the notion of bisimulations. Recently one of the authors has tried to unify a class of these bisimulation based relations by a parametrise...
متن کاملACompleteEquationalAxiomatization for Prefix Iteration with Silent Steps
Fokkink ((1994) Inf. Process. Lett. 52: 333–337) has recently proposed a complete equational axiomatization of strong bisimulation equivalence for MPAδ(Aτ ), i.e., the language obtained by extending Milner’s basic CCS with prefix iteration. Prefix iteration is a variation on the original binary version of the Kleene star operation p∗q obtained by restricting the first argument to be an atomic a...
متن کاملDeciding Observational Congruence of Finite-State CCS Expressions by Rewriting
We propose a term rewriting approach to verify observational congruence between guarded recursive (finite-state) CCS expressions. Starting from the complete axiomatization of observational congruence for this subset of CCS, a non-terminating rewriting relation has been defined. This rewriting relation is co-canonical over a subclass of infinite derivations, structured fair derivations, which co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994